class Solution {
    public boolean isMatch(String s, String p) {
        int m = p.length();
        int n = s.length();
        boolean[][] dp = new boolean[m + 1][n + 1];
        p = " " + p;
        s = " " + s;
        char[] s1 = p.toCharArray();
        char[] s2 = s.toCharArray();

        dp[0][0] = true;
        for(int i = 1; i <= m; i++){
            if(s1[i] == '*') dp[i][0] = true;
            else break;
        }
        for(int i = 1; i <= m; i++){
            for(int j = 1; j <= n; j++){
                if(s1[i] == '?' || s1[i] == s2[j]) dp[i][j] = dp[i - 1][j - 1];
                else if(s1[i] == '*') {
                    dp[i][j] = dp[i - 1][j] || dp[i][j - 1];
                }
            }
        }
        return dp[m][n];
    }
}